An Ordered Set of Size aleph1 with Monochromatic Maximal Chains
نویسندگان
چکیده
Every model of ZFC contains a product of two linear orders, each of size א1, with the property that every subset or complement thereof contains a maximal chain. Mathematics Subject Classification (2000): 06A10.
منابع مشابه
Coloring Ordered Sets to Avoid Monochromatic Maximal Chains
This paper is devoted to settling the following problem on (infinite, partially) ordered sets: Is there always a partition (2-coloring) of an ordered set X so that all nontrivial maximal chains ofX meet both classes (receive both colors)? We show this is true for all countable ordered sets and provide counterexamples of cardinality H3. Variants of the problem are also considered and open proble...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملA classification of hull operators in archimedean lattice-ordered groups with unit
The category, or class of algebras, in the title is denoted by $bf W$. A hull operator (ho) in $bf W$ is a reflection in the category consisting of $bf W$ objects with only essential embeddings as morphisms. The proper class of all of these is $bf hoW$. The bounded monocoreflection in $bf W$ is denoted $B$. We classify the ho's by their interaction with $B$ as follows. A ``word'' is a function ...
متن کاملAn algorithmic approach to maximal unions of chains in a partially ordered set
We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a nite partially ordered set P for every positive integer k. As a consequence, we obtain an algorithmic proof of Greene's Duality Theorem on the relations between the cardinalities of maximal unions of chains and antichains in a nite poset. Mathematics Subject Classi cations (2000). 05A17, 06A07, 68Q25,...
متن کاملExtremal Cases of the Ahlswede-Cai Inequality
We are concerned with the poset P(n)=P([1, 2, ..., n]). This is the power set of [n]=[1, 2, ..., n], ordered by inclusion. A set system is simply a subset of P(n). A set system is an antichain if no two of its members are comparable. Conversely a chain is a totally ordered set system. We shall often consider maximal chains; those chains which cannot be extended. In particular such chains contai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 17 شماره
صفحات -
تاریخ انتشار 2000